#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

bool radixTransform(int n, int d) {
    // n转换成d进制
    string s = "";
    while (n) {
        int mod = n % d;
        s += mod + '0';
        n /= d;
    }
    cout << s << endl;
    int t = stoi(s);
    return  t >= 1 && t <= 9;
}

int n; 
inline void solution() {
    cin >> n;
    while (n -- ) {
        int s;
        cin >> s;
        for (int i = 2; i < s; i ++ ) {
            if (radixTransform(s, i)) {
                cout << i << endl;
                break;
            }
        }
    }
    return ;
}

int main() {
//     freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}
